巴西专利BR112019008180A2 computer-implemented method of a client node, computer-implemented method for regulating trusted pro

专利PDF首页>>巴西专利

专利附录

专利说明

权利要求

类似技术

同族专利

引用文献

法律状态

优先权

专利摘要:
embodiments of the present invention include obtaining, via a client node from a trusted protocol network, a public key from a regulatory node; generating, through the client node, one or more commitment values from a client node confidential transaction by applying a cryptographic commitment scheme to the transaction data of the confidential transaction; generating, through the client node, encrypted confidential transaction regulatory information by encrypting transaction data using the regulatory node public key; and transmitting, through the client node to a trusted protocol network consensus node, confidential transaction content for execution, wherein the confidential transaction content includes: o one or more commitment values; encrypted regulatory information; and one or more proofs of zero knowledge of the transaction data.
公开号:BR112019008180A2
申请号:R112019008180
申请日:2018-11-07
公开日:2019-09-10
发明作者:Wang Huazhong；Li Lichun；Liu Zheng
申请人:Alibaba Group Holding Ltd；
IPC主号:

专利说明:

“METHOD IMPLEMENTED BY COMPUTER OF A NODE CLIENT, METHOD IMPLEMENTED BY COMPUTER TO REGULATE CONFIDENTIAL TRANSACTIONS OF CONFIDENCE PROTOCOL, LEGIBLE MEANS BY COMPUTER AND SYSTEM TO IMPLEMENT A METHOD” Field of the Invention [001] refers to the present methods refer to the present invention computer for confidential transactions based on trusted protocol technologies.
Background of the Invention [002] Distributed accounting systems (DLSs), which can also be called consensus networks and / or trust protocol networks (blockchain), allow participating entities to store data in a secure and immutable way. DLSs are commonly referred to as trust protocol networks without referring to any particular user case (for example, cryptocurrencies). Examples of types of trust networks can include public trust networks, private trust networks and consortium trust networks. A public trust protocol network is open for all entities to use DLS and participate in the consensus process. A private trusted protocol network is provided for a specific entity, which centrally controls read and write permissions. A consortium trust protocol network is provided for a select group of entities, which control the consensus process and include an access control layer.
[003] Trust protocols are used in cryptocurrency networks, which allow participants to make transactions to buy / sell goods and / or services using a cryptocurrency. An
Petition 870190058563, of 25/06/2019, p. 9/49
2/30 common cryptocurrency includes Bitcoin. In cryptocurrency networks, record-keeping models are used to record transactions between users. Examples of record-keeping models include an unrealized transaction balance model (UTXO), and the account model (also referred to as an account-based model or an account / balance model).
[004] In the UTXO model, the chain's assets are in the form of transactions. Each transaction spends the balance of previous transactions and generates new balances that can be spent on subsequent transactions. A user's unspent transactions are tracked and a balance the user must spend is calculated as the sum of the unspent transactions. Each transaction takes into account one or more unspent balances (and only unspent balances) as input and can have one or more balances. The requirement that only unused balances can be used for other transactions is necessary to avoid double spending and fraud. The UTXO model supports transaction and function proof validation, but support for smart contracts is weak.
[005] The account model is adopted by Ethereum. The account model performs record keeping and manages account balances like a traditional bank. Under this model, an account can have an address and a corresponding account balance. The assets in the chain are represented as the account balance. Each transfer transaction can have an account address for a transferred asset and an account address for a received asset. The transaction amount is directly updated in the account balance. The account model is efficient, since each transaction may only need to validate that the sending account has sufficient balance to pay for the transaction. In addition to supporting transaction validation and proofing, the account model can fully support smart contracts, especially those that require state information or involve multiple parties.
Petition 870190058563, of 25/06/2019, p. 10/49
3/30
Description of the Invention [006] Embodiments of the present invention include computer-implemented methods for confidential transactions based on trust protocol technologies (referred to as confidential trust protocol transactions or, simply, confidential transactions). More particularly, the embodiments of the present invention are intended to regulate confidential trust protocol transactions.
[007] In some embodiments, the actions include obtaining, through a client node of a trust protocol network, a public key from a regulatory node; generate, through the client node, one or more commitment values of a confidential transaction from the client node, applying a cryptographic commitment scheme to the transaction data of the confidential transaction; generate, through the client node, encrypted regulatory information of the confidential transaction, encrypting the transaction data using the public key of the regulatory node; and transmit, through the client node to a consensus node of the trust protocol network, a confidential transaction content for execution, where the confidential transaction content includes: o one or more commitment values; encrypted regulatory information; and one or more proofs of zero knowledge of the transaction data. Other embodiments include corresponding systems, devices and computer programs, configured to perform the actions of the methods, encoded in computer storage devices.
[008] In some embodiments, the actions include generating, by a regulatory node of a trust protocol network, a pair of a public key and a private key; publication, through the regulatory node, of the public key for a plurality of client nodes in the
Petition 870190058563, of 25/06/2019, p. 11/49
4/30 confidence; obtain, through the regulatory node from a trust protocol consensus node, the content of a confidential transaction of a client node, where the content of the confidential transaction includes: one or more commitment values of the confidential transaction generated by the client node applying a cryptographic compromise scheme to the transaction data of the confidential transaction; one or more proofs of zero knowledge of the transaction data; and encrypted regulatory information generated by the client node encrypting the transaction data using the regulator node's public key; obtain the transaction data by decrypting the encrypted regulatory information using the private key of the regulatory node; and verify, through the regulatory node, that the confidential transaction is legitimate based on the content of the confidential transaction and the decrypted transaction data.
[009] These and other embodiments may optionally include one or more of the following characteristics.
[0010] A first feature, combinable with any of the following features, in which the transaction data of the confidential transaction includes one or both balances of a client node account before the confidential transaction or a transaction value of the confidential transaction.
[0011] A second characteristic, combinable with any of the previous or following characteristics, in which the one or more proofs of zero knowledge of the transaction data include one or more ranges of proofs of zero knowledge that the values of the transaction data are within their respective intervals.
[0012] A third characteristic, combinable with any of the previous or following characteristics, in which one or more proofs of zero knowledge of the transaction data include a proof of zero knowledge that the client node uses the public key of the regulatory node in
Petition 870190058563, of 25/06/2019, p. 12/49
5/30 generation of encrypted regulatory information for the confidential transaction.
[0013] A fourth characteristic, combinable with any of the previous or following characteristics, in which the cryptographic compromise scheme includes a Pedersen compromise scheme; where generating one or more commitment values from a client node confidential transaction by applying a cryptographic commitment scheme to transaction data includes generating one or more commitment values from the client node's confidential transaction based on the transaction data and corresponding random numbers transaction data; and wherein the generation of encrypted confidential transaction regulatory information includes the generation of encrypted confidential transaction regulatory information by encrypting the transaction data and random numbers corresponding to the transaction data using the public key of the regulatory node.
[0014] A fifth feature, which can be combined with any of the previous or following features, in which the content of the confidential transaction also includes a digital signature of the client node.
[0015] A sixth feature, combinable with any of the previous or following features, in which it verifies that the confidential transaction is valid based on the contents of the confidential transaction and the decrypted transaction data includes one or more of: determining that one or more commitment values are correct based on the commitment scheme; verify one or more proofs of zero knowledge of the transaction data; or determine that the values of the transaction data are in compliance with the regulations.
[0016] A seventh characteristic, combinable with any of the previous or following characteristics, in which the verification of one or more proofs of zero knowledge of the transaction data includes one or more
Petition 870190058563, of 25/06/2019, p. 13/49
6/30 of: determining that an account balance of the client node before the confidential transaction is greater than zero; determine that a transaction value of the confidential transaction is greater than zero; and determining that a transaction value of the confidential transaction is less than or equal to an account balance of the client node prior to the confidential transaction.
[0017] The present invention also provides one or more computer-readable storage media, non-transitory coupled to one or more processors and having instructions stored in it that, when executed by one or more processors, causes the one or more processors perform the operations according to embodiments of the methods provided here.
[0018] The present invention further provides a system for implementing the methods provided herein. The system includes one or more processors, and a computer-readable storage medium coupled to one or more processors with instructions stored on it that, when executed by one or more processors, cause one or more processors to perform operations according to forms of realization of the methods provided here.
[0019] It is understood that the methods according to the present invention can include any combination of the aspects and characteristics described herein. That is, methods according to the present invention are not limited to the combinations of aspects and characteristics specifically described herein, but also include any combination of the aspects and characteristics provided.
[0020] Details of one or more embodiments of the present invention are presented in the accompanying drawings and in the description below. Other features and advantages of the present invention will be apparent from the description and drawings, and from the claims.
Petition 870190058563, of 25/06/2019, p. 14/49
7/30
Brief Description of the Drawings [0021] Figure 1 illustrates an example of an environment that can be used to carry out the embodiments of the present invention.
[0022] Figure 2 illustrates an example of conceptual architecture according to the embodiments of the present invention.
[0023] Figure 3 illustrates an example of a process for regulating a confidential trust protocol transaction according to the embodiments of the present invention.
[0024] Figure 4 illustrates an example of the content of a confidential trust protocol transaction according to the embodiments of the present invention.
[0025] Figure 5 illustrates an example of a process that can be performed according to the embodiments of the present invention.
[0026] Similar reference symbols in the various drawings indicate similar elements.
Description of Embodiments of the Invention [0027] Embodiments of the present invention include computer-implemented methods for confidential transactions based on trust protocol technologies (referred to as confidential trust protocol transactions or, simply, confidential transactions). More particularly, the embodiments of the present invention are intended to regulate confidential trust protocol transactions.
[0028] In some embodiments, the actions include obtaining, through a client node of a trust protocol network, a public key from a regulatory node; generate, through the client node, one or more commitment values of a confidential transaction from the client node, applying a cryptographic commitment scheme to the data of
Petition 870190058563, of 25/06/2019, p. 15/49
8/30 confidential transaction transaction; generate, through the client node, encrypted regulatory information of the confidential transaction, encrypting the transaction data using the public key of the regulatory node; and transmit, through the client node to a trust protocol consensus node, a confidential transaction content for execution, where the confidential transaction content includes: o one or more commitment values; encrypted regulatory information; and one or more proofs of zero knowledge of the transaction data.
[0029] In some embodiments, the actions include generating, by a regulatory node of a trust protocol network, a pair of a public key and a private key; publication, by the regulatory node, of the public key for a plurality of client nodes in the trust protocol network; obtain, by the regulating node of a consensus node of the trust protocol network, the content of a confidential transaction from a client node, where the content of the confidential transaction includes: one or more commitment values of the confidential transaction generated by the client node applying a cryptographic compromise scheme to the transaction data of the confidential transaction; one or more proofs of zero knowledge of the transaction data; and encrypted regulatory information generated by the client node encrypting the transaction data using the regulator node's public key; obtain the transaction data by decrypting the encrypted regulatory information using the private key of the regulatory node; and verify, through the regulatory node, that the confidential transaction is legitimate based on the content of the confidential transaction and the decrypted transaction data.
[0030] Other embodiments include corresponding systems, devices and computer programs, configured to perform the actions of the methods, encoded in storage devices of
Petition 870190058563, of 25/06/2019, p. 16/49
9/30 computer.
[0031] To provide an additional context for embodiments of the present invention, and as introduced above, distributed accounting systems (DLSs), which can also be referred to as consensus networks (for example, constituted by peer-to-peef nodes ), and trust protocol networks, allow participating entities to conduct transactions securely and immutably and store data. Although the term trust protocol is generally associated with the Bitcoin cryptocurrency network, the trust protocol is used here to refer generally to a DLS without reference to any particular use case. As introduced above, a trust protocol network can be provided as a public trust protocol network, a private trust protocol network, or a consortium trust network.
[0032] In a public trust protocol network, the consensus process is controlled by nodes in the consensus network. For example, hundreds, thousands, even millions of entities can cooperate in a public trust protocol network, each of which operates at least one node in the public trust protocol network. Thus, the public trust protocol network can be considered a public network in relation to the participating entities. In some examples, most entities (nodes) must sign each block in order for the block to be valid, and added to the trust protocol (distributed accounting) of the trust protocol network. An example of a public trust protocol network includes the Bitcoin network, which is a peer-to-peer payment network. The Bitcoin network uses distributed accounting, known as a trust protocol. As noted above, the term trust protocol, however, is used to generally refer to distributed accounts with no particular reference to the Bitcoin network.
Petition 870190058563, of 25/06/2019, p. 17/49
10/30 [0033] In general, a public trust protocol network supports public transactions. A public transaction is shared with all nodes within the public trust protocol network and is stored in a global trust protocol. A global trust protocol is a trust protocol that is replicated on all nodes. That is, all nodes are in a perfect state of consensus regarding the global trust protocol. To reach consensus (for example, agreeing to add a block to a trust protocol), a consensus protocol is implemented within the public trust protocol network. An example of a consensus protocol includes, without limitation, proof of work (POW) implemented in the Bitcoin network.
[0034] In general, a private trust protocol network is provided for a particular entity, which centrally controls read and write permissions. The entity controls which nodes are able to participate in the trust protocol network. Consequently, private trust protocol networks are generally referred to as allowed networks that place restrictions on who is allowed to participate in the network, and on their level of participation (for example, only in certain transactions). Various types of access control mechanisms can be used (for example, existing participants vote to add new entities, a regulatory authority can control admission).
[0035] In general, a consortium trust protocol network is private between participating entities. In a consortium trust protocol network, the consensus process is controlled by an authorized set of nodes, one or more nodes being operated by a respective entity (for example, a financial institution, insurance company). For example, a consortium of ten (10) entities (for example, a financial institution, insurance company) can operate a network of
Petition 870190058563, of 25/06/2019, p. 18/49
11/30 consortium trust protocol, one operating at least one node in the consortium trust protocol network. In this sense, the consortium trust protocol network can be considered a private network in relation to the participating entities. In some examples, each entity (node) must sign all blocks for the block to be valid and added to the trust protocol. In some examples, at least a subset of entities (nodes) (for example, at least 7 entities) must sign all blocks for the block to be valid and added to the trust protocol.
[0036] The embodiments of the present invention are described in more detail herein with reference to a consortium trust protocol network. It is contemplated, however, that the embodiments of the present invention can be carried out in any appropriate type of trust protocol network.
[0037] The embodiments of the present invention are described here in greater detail in view of the above context. More particularly, and as shown above, the embodiments of the present invention are intended to regulate confidential trust protocol transactions.
[0038] A trust protocol is a tamper-proof shared digital record that records transactions on a public or private peer-to-peer network. The record is distributed to all member nodes in the network and the history of asset transactions occurring on the network is permanently recorded in the block. As the registry is fully public for participating entities, the trust protocol registry itself does not have a privacy protection function and requires additional technology to protect the privacy of the content of the asset transaction.
[0039] Privacy protection techniques for trust protocol may include those for conducting a confidential transaction for
Petition 870190058563, of 25/06/2019, p. 19/49
12/30 protect the privacy of a transaction's content. In a confidential transaction, the content of a transaction is only accessible or known to the participants in the transaction, and not to other outsiders. For example, a confidential transaction allows only the two parties participating in the transaction to be aware of the amount to be transacted, and external observers are prevented from knowing this information. Such techniques for conducting confidential transactions have been used, for example, in MONERO and ZCASH.
[0040] Privacy protection techniques for trust protocol can also include those to protect identities of parts of a transaction, such as, for example, using an invisible address or a ring signature mechanism.
[0041] With privacy protection added to the trust protocol (for example, in the context of confidential transactions), it is difficult for one or more regulators (such as government, industry associations, etc.) to audit, examine, inspect, supervise, or otherwise regulate transactions. For example, it is difficult for a regulator (or supervisor) on a consortium trust protocol network to verify the formality and validity of the confidential transaction content because the transaction information stored in the trust protocol is encrypted, which would limit applications of the trust protocol.
[0042] Examples of techniques are described to solve the problem to make it possible and easier for the regulator to regulate the content of the trust protocol, especially in the case of confidential trust protocol transactions. The examples of techniques can be based on the account model and have the advantages of supporting smart contracts.
[0043] For example, when sending a confidential transaction, a user can encrypt both a random number and a text value
Petition 870190058563, of 25/06/2019, p. 20/49
13/30 without formatting (for example, an account balance before the confidential transaction or a transfer amount from the confidential transaction) corresponding to the Pedersen Commitment in the transaction (described in more detail below), and you can use a public key from the regulator to encrypt it and send it as part of the transaction data. The regulator can use its private key to decrypt Pedersen's Compromise for each transaction at any time, thereby determining whether each transaction meets regulatory requirements without any additional chain interactions, such as sending a query to each participant in the chain at the time of the audit , receive results returned from each participant to analyze and the result returned to verify each transaction.
[0044] The proposed techniques can preserve the decentralized property of the trust protocol and do not require a central node or a third party, for example, which is relied on a technology based on group signature or other techniques to implement a regulatory solution in the protection of privacy of trust protocol transactions. The proposed techniques do not require the regulator to sign each transaction before each transaction is submitted. Thus, the proposed techniques do not depend on a central node and, therefore, prevent the central node in the trust protocol network from becoming a bottleneck in system performance, security, etc.
[0045] Figure 1 illustrates an example of an environment (100) that can be used to carry out embodiments of the present invention. In some examples, the sample environment (100) allows entities to participate in a consortium trust protocol network (102). The example environment (100) includes computing systems or devices (106, 108) and a network (110). In some examples, the network (110) includes a network
Petition 870190058563, of 25/06/2019, p. 21/49
14/30 local area (LAN), wide area network (WAN), the Internet or a combination of them, and connects web sites, user devices (for example, computing devices) and back-end system. In some examples, the network (110) can be accessed via a wired and / or wireless communication link.
[0046] In the example described, the computing systems (106, 108) can include any appropriate computing system that allows participation as a node in the consortium trust protocol network (102). Examples of computing devices include, without limitation, a server, a desktop computer, a laptop computer, a tablet computer device and a smartphone. In some instances, computer systems (106, 108) host one or more services implemented per computer to interact with the consortium trust protocol network (102). For example, the computing system (106) can host computer-implemented services from a first entity (for example, user A), such as the transaction management system that the first entity uses to manage its transactions with one or more entities ( for example, other users). The computing system (108) can host computer-implemented services from a second entity (for example, user B), such as the transaction management system that the second entity uses to manage its transactions with one or more other entities (for example , other users). In the example in Figure 1, the consortium trust protocol network (102) is represented as a peer-to-peer network of nodes, and the computing systems (106, 108) provide nodes of the first entity and second entity, respectively , who participate in the consortium trust protocol network (102).
[0047] Figure 2 illustrates an example of conceptual architecture (200) according to embodiments of the present invention. The architecture
Petition 870190058563, of 25/06/2019, p. 22/49
The exemplary conceptual 15/30 (200) includes an entity layer (202), a hosted services layer (204) and a trust protocol network layer (206). In the example shown, the entity layer (202) includes three entities, Entity_1 (E1), Entity_2 (E2) and Entity_3 (E3), each entity having a respective transaction management system (208).
[0048] In the example described, the hosted services layer (204) includes interfaces (210) for each transaction management system (208). In some examples, a respective transaction management system (208) communicates with a respective interface (210) over a network (for example, the network (110) in Figure 1) using a protocol (for example, data transfer protocol) secure hypertext (HTTPS)). In some examples, each interface (210) provides a communication connection between a respective transaction management system (208), and the trust protocol network layer (206). More particularly, the interface (210) communicates with a trust protocol network (212) of the trust protocol layer (206). In some examples, communication between an interface (210) and the trust protocol network layer (206) is conducted using remote procedure calls (RPCs). In some examples, interfaces (210) "host" the trust protocol network nodes for the respective transaction management systems (208). For example, interfaces (210) provide the application programming interface (API) for accessing the trusted protocol network (212).
[0049] As described here, the trust protocol network (212) is provided as a peer-to-peer network including a plurality of nodes (214) that record information immutably in a trust protocol (216). Although a single trust protocol (216) is schematically represented, several copies of the trust protocol (216) are provided, and are maintained through the trust protocol network
Petition 870190058563, of 25/06/2019, p. 23/49
16/30 (212). For example, each node (214) stores a copy of the trust protocol. In some embodiments, the trust protocol (216) stores information associated with transactions that are carried out between two or more entities that participate in the consortium trust protocol network.
[0050] Figure 3 illustrates an example of a regulatory process (300) for a confidential trust protocol transaction (transaction) according to the embodiments of the present invention. A (302) and B (304) represent two client nodes of two users (also called clients, entities, participants or parties) of a transaction and S (306) is a regulator (or supervisor) node in a protocol network. trust (350). The trust protocol network (350) can include multiple consensus nodes (denoted as trust protocol nodes (308) in Figure 3).
[0051] In some embodiments, A (302) and B (304) are examples of computing systems (106, 108) that correspond to a first and second user or entity as described in Figures 1 and 2. Each client node A (302) or B (304) has a corresponding account (for example, a public account or a private account) for transactions through the trust protocol network (350).
[0052] In some embodiments, client node A (302) may perform a confidential transaction with client node B (304), so that the transaction information is only visible or otherwise known to client node A ( 302) and client node B (304), but not from other parties (e.g., trust protocol nodes (308)) in the trust protocol network (350).
[0053] In some embodiments, some or all transactions carried out on the trust protocol network (350) may be
Petition 870190058563, of 25/06/2019, p. 24/49
17/30 subject to regulation by regulatory node S (306). For example, regulatory node S (306) can determine whether a particular transaction complies with certain rules or regulations, for example, by monitoring, inspecting, auditing, supervising or otherwise regulating the transaction. In some embodiments, the transaction information for a confidential transaction can be made available and viewed by regulatory node S (306).
[0054] In some embodiments, to have access to transaction information for a confidential transaction, keeping the transaction confidential, the regulatory node S (306) can generate a key pair, a public key Spub (316) and a Spriv private key (326). Regulatory node S (306) can publish or issue the public key Spub (316) to client nodes (for example, A (302) and B (304)) in the trust protocol network (350), so that a node customer can use the public key Spub (316) to encrypt the transaction information. Because it is encrypted, the transaction information is not visible to other third parties, but accessible to regulatory node S (306) because regulatory node S (306) can decrypt encrypted transaction information using its private key Spriv (326).
[0055] For example, as shown in Figure 3, before the transaction, client node A (302) has an account balance a and client node B (304) has an account balance b. In (310), client node A (302) creates a confidential transaction to transfer a quantity t to client node B (304). In some embodiments, client node A (302) can locally construct confidential transaction content and submit the confidential transaction content to the trust network (350) (for example, one or more trust protocol nodes ( 308) in the trust protocol network (350)).
[0056] Figure 4 illustrates an example of content (400) of a
Petition 870190058563, of 25/06/2019, p. 25/49
18/30 example confidential transaction (450) according to the embodiments of the present invention. As illustrated, the confidential transaction example (450) is the transfer of a transaction value from client node A (302) to client node B (304) as described in relation to Figure 3.
[0057] In some embodiments, the confidential transaction (450) can be constructed based on a commitment scheme to hide the transaction data (for example, the account balance before the transaction and the amount of the transaction). An example of a compromise scheme includes, without limitation, Pedersen's Commitment (PC). For example, client node A (302) generates a commitment value based on a transaction value t and a random number r using the PC. For example, the commitment value includes a cipher text that can be obtained according to PC (f) = rG + tH, where G and H can be generators of an elliptic curve, PC (f) is a scalar multiplication of points of curve, is the value that is compromised. The PC commitment scheme has a homomorphism, that is, PC (ti) + PC = PC (ti + fe). Holders of the ciphertext PC (f) can check the value of transaction t using the random number r. Although the embodiments of the present disclosure are described here in greater detail with reference to the PC, it is contemplated that the embodiments of the present disclosure can be carried out using any appropriate commitment scheme.
[0058] In the example of confidential transaction (450), client node A (302) can commit to a pre-transaction account balance a and a transfer amount t. In some embodiments, client node A (302) can generate a commitment amount PC (a) using a PC based on the pre-transaction account balance a and a random number corresponding to ra. Likewise, client node A (302) can generate a commitment amount PC (t) using the PC based on the pre account balance
Petition 870190058563, of 25/06/2019, p. 26/49
19/30 transaction a and a random number corresponding to rt. In some embodiments, client node A (302) can also commit that it has sufficient funds so that the post-transaction balance at -1 is greater than or equal to 0. For example, client node A (302) can generate a value of commitment PC (a- í), for example, based on the values of commitment PC (a) and PC (f), homomorphic property of the PC. Commitment amounts can be included in the content (400) of the confidential transaction example (450).
[0059] In some embodiments, additional or different commitment values may be included. For example, client node A (302) can commit that it uses the regulator's public key (for example, the public key Spub (316)) to encrypt the transaction information. For example, client node A (302) can generate a PC commitment value (Spub) based on Spub and transaction information.
[0060] To facilitate regulator regulation, client node A (302) can also encrypt transaction information, such as quantity a, t and random number corresponding to ra, rt of each Pedersen commitment involved in the transaction using the public key Regulator spub. For example, client node A (302) can also encrypt transaction information (for example, ra, a, rt, t) using Spub and obtain encrypted regulatory information, for example, ciphertext M denoted as encrypting (Spub , (ra | a | rt | t)). As an example, the ciphertext M can be a ciphertext concatenation of the four elements ra, a, rt, t or in another format. In some embodiments, the encrypted regulatory information may include additional or different transaction information and may be generated in another way.
[0061] In some embodiments, the content (400) of the confidential transaction example (450) may include one or more proofs of
Petition 870190058563, of 25/06/2019, p. 27/49
20/30 zero knowledge to allow a receiving party to confirm that the information of the sending party is sending is valid. The zero knowledge test allows the receiving party to do this without real knowledge of the information to be confirmed. Zero knowledge tests can include interval tests, such as Exam (a> 0), Exam (t> 0) and Exam (a> 0), or other types of exam. Zero knowledge tests allow the receiving party (for example, client node B) to confirm that the sending party (for example, client node A) has sufficient funds to transfer (that is, at -1> 0) and that the value of the transfer is greater than zero, without knowing the balance from which the amount is being transferred, or even the transfer amount t.
[0062] In some embodiments, the content (400) of the confidential transaction example (450) may include other information related to the transaction, such as A's digital signature on the transaction.
[0063] Referring again to Figure 3, after generating the content of the transaction (for example, the content (400) of the confidential transaction example), client node A (302) can send the content of the confidential transaction to the network trust protocol (350) (for example, one or more trust protocol nodes (308) in the trust protocol network (350)). At (320), the trust protocol network (350) can perform the confidential transaction. In some embodiments, the confidential transaction can be performed by each of the trust protocol nodes (308) in the trust protocol network (350). For example, each of the trust protocol nodes (308) can determine whether the content of the confidential transaction is legitimate, for example, by checking one or more default values and zero knowledge evidence included in the content of the confidential transaction. For example, each of the trust protocol nodes (308) can verify the commitment values by checking PC (a) = PC (t) + PC (a -1), that is, incoming transaction values are equal to
Petition 870190058563, of 25/06/2019, p. 28/49
21/30 balance transaction amounts. Each of the trust protocol nodes (308) can verify zero knowledge tests, for example, based on Bulletproofs, Monero's RingCT algorithms or any other suitable algorithms.
[0064] Once the commitment values and zero knowledge tests have been verified, each of the trust protocol nodes (308) can record the transaction and update the accounts of client node A (302) and client node B (304 ). For example, after the transaction, client node A (302) has an account balance while client node B (304) has a balance of n b + t. In some embodiments, the post-transaction balance of client node A (302) and client node B (304) can be reflected by the direct operations of the commitment amount due to the homomorphism of the confirmation scheme. For example, client node A (302) can now have a commitment amount for a post-transaction account balance PC (a -t) = PC (a) - PC (í). Client node B (304) can now have a commitment amount for a post-transaction account balance PC (b + t) = PC (b) + PC (í).
[0065] In (330), to regulate the confidential transaction, the regulatory node S (306) obtains the content of the confidential transaction from the trust protocol network (350) and determines whether the transaction information satisfies regulatory criteria or requirements. For example, the regulatory node (306) can obtain the contents of the confidential transaction that contains encrypted regulatory information (for example, an M = encrypted ciphertext (Spub, (ra | a | rt | t) as shown in Figure 4). Regulatory node S (306) uses its private key Spriv (326) to decrypt regulatory encrypted information and obtains the plain text transaction information (for example, ra, a, rt, t) corresponding to the PCs in the transaction. regulator S (306) can determine whether transaction information meets regulatory criteria or requirements, verifies the validity of commitment values
Petition 870190058563, of 25/06/2019, p. 29/49
22/30 based on clear text transaction information. For example, regulatory node S (306) can perform traditional regulation, as it determines whether the transaction amount is below a maximum allowed transaction amount.
[0066] In some embodiments, the regulatory node S (306) can subscribe to some or all of the transactions carried out on the trust protocol network (350), so that the transaction data of the transactions can be sent to the regulatory node S (306) automatically. In some embodiments, regulatory node S (306) can fetch, pull, or retrieve transaction data from some or all transactions in the trust protocol network (350) (for example, from one or more trust protocol nodes (308) in the trust protocol network (350)).
[0067] Figure 5 illustrates an example of process (500) that can be performed in accordance with the embodiments of the present invention. In some embodiments, the process example (500) can be performed using one or more computer executable programs executed using one or more computing devices. For clarity of presentation, the description that follows generally describes method (500) in the context of the other figures in this description. For example, the regulatory node (510) can be the regulatory node S (306), the trust protocol node (520) can be the trust protocol node (308), the client node A (530) can be the client node A (302), and client node B (540) can be client node B (304) as described in relation to Figure 3. However, it will be understood that method (500) can be executed, for example, by any suitable system, environment, software and hardware, or a combination of systems, environments, software and hardware, as appropriate. In some embodiments, several steps of the method (500) can be performed in parallel,
Petition 870190058563, of 25/06/2019, p. 30/49
23/30 in combination, in loops or in any order.
[0068] In (512), the regulatory node (510) of a trust protocol network generates a pair of a public key and a private key. The public key pair and the private key can be used to encrypt and decrypt transaction information for regulation.
[0069] In (514), the regulatory node (510) publishes the public key to a plurality of client nodes (for example, client node A (530) and client node B (540)) of the trust protocol network. For example, the regulatory node (510) can issue the public key to all client nodes in the trust protocol network (for example, a consortium trust protocol network) that are subject to the regulation of the regulatory node.
[0070] In (532), client node A (530), a client node of the trust protocol network, obtains the public key from the regulatory node (510). Client node A (530) can use the regulator node's public key (510) to encrypt transaction data subject to regulation, thus allowing the regulator node (510) to decrypt the transaction data using the private key corresponding to the public key.
[0071] Client node A (530) can prepare for a confidential transaction (535), such as transferring a fund amount from a client node account (530) to a client node account B (540) , another client node of the trust protocol network. Client node A (530) can build the content of the confidential transaction to protect the privacy of the transaction data and hide the transaction data by avoiding inspection by other entities except the participants in the transaction (ie client node A (530) and client node B (540) in this example) and regulator node (510). In some embodiments, client node A (530) may hide the transaction from a confidential transaction based on a confirmation scheme.
[0072] In some embodiments, transaction data
Petition 870190058563, of 25/06/2019, p. 31/49
24/30 of the confidential transaction includes one or both account balances of client node A (530) prior to the confidential transaction or a transaction value of the confidential transaction. In some embodiments, the transaction data of the confidential transaction may include additional transaction information (for example, transaction date, the parties to the transaction, type of asset (for example, stock security or another type)).
[0073] In (534), client A's node (530) generates one or more confidential transaction commitment values from client A's (530) node by applying a cryptographic commitment scheme to the confidential transaction data of the transaction. In some embodiments, the cryptographic compromise scheme includes a homomorphic cryptographic compromise scheme, such as a Pedersen compromise scheme, or other type of compromise scheme.
[0074] In 536, client node A (530) generates encrypted regulatory information from the confidential transaction by encrypting the transaction data using the public key of the regulatory node (510), where the encrypted regulatory information is configured to allow decryption by regulatory node (510) using the private key corresponding to the public key.
[0075] In some embodiments, the cryptographic compromise scheme includes the Pedersen commitment scheme. In this case, generating one or more compromise values from a customer A node's confidential transaction (530) by applying a cryptographic compromise scheme to the transaction data includes generating one or more compromise values from the customer A's confidential transaction. (530) based on the transaction data and random numbers corresponding to the transaction data; and generate regulatory information
Petition 870190058563, of 25/06/2019, p. 32/49
25/30 encrypted confidential transaction includes generating encrypted regulatory information from the confidential transaction by encrypting the transaction data and random numbers corresponding to the transaction data using the regulator node's public key.
[0076] In (538), client node A (530) sends the contents of the confidential transaction to the trust protocol network for execution, for example, transmitting the contents of the confidential transaction to the trust protocol node (520) ( for example, a trust protocol network consensus node). In some embodiments, the content of the confidential transaction may include: the one or more commitment values of the confidential transaction generated by client node A (530), applying the cryptographic commitment scheme to the transaction data of the confidential transaction; the encrypted regulatory information generated by client node A (530), encrypting the transaction data using the public key of regulatory node S (510); and one or more proofs of zero knowledge of the transaction data.
[0077] In some embodiments, one or more zero knowledge proofs of the transaction data, includes one or more zero knowledge proof ranges, that the values of the transaction data are within the respective ranges. For example, one or more zero knowledge proof intervals may include a zero knowledge proof interval that the account balance of client node A (530) before the confidential transaction is greater than zero, a knowledge proof interval zero that the transaction amount of the confidential transaction is greater than zero, and a zero proof interval of knowledge that the transaction amount is less than or equal to the account balance of client node A (530) before the confidential transaction.
[0078] In some embodiments, one or more tests of
Petition 870190058563, of 25/06/2019, p. 33/49
26/30 zero knowledge of transaction data includes zero knowledge proof that client node A (530) uses the public key of the regulatory node (510) in generating the encrypted regulatory information of the confidential transaction.
[0079] In some embodiments, the content of the confidential transaction also includes a digital signature from client node A (530). In some embodiments, the content of the confidential transaction may include additional or different information.
[0080] In (522), upon receiving the contents of the confidential transaction, the trust protocol node (520) can execute the confidential transaction, for example, verifying that the confidential transaction is valid based on the contents of the confidential transaction. In some embodiments, verification that the confidential transaction is valid based on the content of the confidential transaction may include one or more of the following: determining that one or more commitment values are correct based on the commitment scheme and / or one or more tests of zero knowledge; or check one or more proofs of zero knowledge of the transaction data, for example, according to algorithms as described in relation to Figure 3.
[0081] In (524), after verifying that the confidential transaction is valid, the trust protocol node (520) can, for example, register the transaction (for example, storing the contents of the confidential transaction in a trust protocol in the trust protocol network) and update the account information performed by the confidential transaction (for example, the account balance of client node A (530) and client node B (540)), for example, according to the techniques described in relation to Figure 3 or other techniques.
[0082] In (516), the regulatory node (510) obtains from the trust protocol node (520) (for example, a consensus node of the protocol network of
Petition 870190058563, of 25/06/2019, p. 34/49
27/30 trust) the contents of the confidential transaction of client A's node (530). The content of the confidential transaction can include the sample content (400) of the confidential transaction example (450), as described in relation to Figure 4 [0083] In (518), the regulatory node (510) obtains the transaction data by decrypting regulatory information encrypted using the private key of the regulatory node.
[0084] In (519), the regulatory node (510) checks whether the confidential transaction is legitimate based on the content of the confidential transaction and the transaction data. In some embodiments, verifying that the confidential transaction is valid based on the contents of the confidential transaction and the decoded transaction data includes one or more of: the determination that one or more commitment values are correct based on the commitment scheme and / or one or more tests of zero knowledge; verification of one or more proofs of zero knowledge of the transaction data; or determining that the transaction data values are in compliance with the regulation.
[0085] In some embodiments, verify that one or more proofs of zero knowledge of the transaction data includes one or more of: determining that the account balance of client node A (530) before the confidential transaction is greater than zero ; determine that the transaction value of the confidential transaction is greater than zero; or determine that a transaction amount for the confidential transaction is less than or equal to the account balance of client node A (530) prior to the confidential transaction.
[0086] The described features can be implemented in digital electronic circuits or in computer hardware, firmware, software or in combinations thereof. The device can be implemented in a computer program product tangibly embedded in a vehicle
Petition 870190058563, of 25/06/2019, p. 35/49
28/30 of information (for example, on a machine-readable storage device) for realization by a programmable processor; and the steps of the method can be performed by a programmable processor executing an instruction program to execute functions of the described embodiments operating on the input data and generating the output. The described features can be advantageously implemented in one or more computer programs that are executable in a programmable system including at least one programmable processor coupled to receive data and instructions from, and to transmit data and instructions to, a data storage system, at least one input device and at least one output device. A computer program is a set of instructions that can be used, directly or indirectly, on a computer to perform a certain activity or obtain a certain result. A computer program can be written in any form of programming language, including compiled or interpreted languages, and can be implemented in any way, including as a stand-alone program or as a module, component, subroutine or other unit suitable for use in a computing environment.
[0087] Processors suitable for carrying out an instruction program include, for example, microprocessors for general and special use, and the single processor or one of multiple processors of any type of computer. Generally, a processor will receive instructions and data from either a read-only memory or a random access memory or both. The elements of a computer can include a processor to execute instructions and one or more memories to store instructions and data. Generally, a computer can also include, or is operationally attached to communicate with, one or more mass storage devices to store data files;
Petition 870190058563, of 25/06/2019, p. 36/49
29/30 such devices include magnetic disks, such as internal hard drives and removable disks; magneto-optical discs; and optical discs. Storage devices suitable for tangibly incorporating computer program instructions and data include all forms of non-volatile memory, including, for example, semiconductor memory devices, such as EPROM, EEPROM and flash memory devices; magnetic disks, such as internal hard drives and removable disks; magneto-optical discs; and CD-ROM and DVD-ROM discs. The processor and memory can be supplemented by, or incorporated into, application-specific integrated circuits (ASICs).
[0088] To provide interaction with a user, the features can be implemented on a computer with a display device, such as a cathode ray tube (CRT) or liquid crystal (LCD) monitor to display information to the user and a keyboard and a pointing device, such as a mouse or a trackball, through which the user can provide input to the computer.
[0089] The features can be implemented on a computer system that includes an administrative panel component (back-end), such as a data server, or that includes a middleware component, such as an application server or an Internet server , or that includes a front-end user interface component, such as a client computer with a graphical user interface or an Internet browser, or any combination thereof. The system components can be connected by any form or means of digital data communication, such as a communication network. Examples of communication networks include, for example, a local area network (LAN), a wide area network (WAN) and the computers and networks that make up the Internet.
[0090] The computer system can include customers and
Petition 870190058563, of 25/06/2019, p. 37/49
30/30 servers. A client and a server are usually remote with each other and usually interact over a network, as described. The client and server relationship arises because of computer programs running on the respective computers and having a client-server relationship between them.
[0091] In addition, the logical flows represented in the figures do not require the particular order shown, or sequential order, to achieve the desired results. In addition, other steps can be provided, or steps can be eliminated, from the described flows, and other components can be added or removed from the described systems. Therefore, other embodiments are within the scope of the following claims.
[0092] A number of embodiments of the present invention have been described. However, it will be understood that various modifications can be made without departing from the scope of the present invention. Therefore, other embodiments are within the scope of the following claims.

权利要求:
Claims (15)
[1]
Claims
1. METHOD (500) IMPLEMENTED BY A CLIENT NODE COMPUTER (530) participating in a confidential trust protocol transaction, the method characterized by the fact that it comprises:
obtaining (532), through a client node (530) a trust protocol network, a public key (514) from a regulatory node;
generate (534), through the client node (530), one or more commitment values of a confidential transaction from the client node (530), applying a cryptographic commitment scheme to the transaction data of the confidential transaction;
generate (536), through the client node (530), encrypted regulatory information of the confidential transaction, encrypting the transaction data using the public key of the regulatory node; and transmitting (538), through the client node (530) to a consensus node (520) of the trust protocol network (350), a content of the confidential transaction for execution, where the content of the confidential transaction comprises:
one or more commitment values;
encrypted regulatory information; and one or more proofs of zero knowledge of the transaction data.
[2]
2. METHOD (500) according to claim 1, characterized by the fact that the transaction data of the confidential transaction comprise one or both of the account balances of the client node (530) before the confidential transaction or a transaction value of the confidential transaction.
[3]
3. METHOD (500), according to claim 1, characterized by the fact that one or more tests of zero knowledge
Petition 870190058563, of 25/06/2019, p. 39/49
2/5 of the transaction data comprises one or more zero knowledge proof intervals in which the values of the transaction data are within the respective intervals.
[4]
4. METHOD (500), according to claim 1, characterized by the fact that one or more proofs of zero knowledge of the transaction data comprises a proof of zero knowledge that the client node (530) uses the public key ( 514) of the regulatory node (510) in the generation of the encrypted regulatory information of the confidential transaction.
[5]
5. METHOD (500), according to claim 1, characterized by the fact that the cryptographic compromise scheme includes a Pedersen commitment scheme;
where generating (534) one or more compromise values from a confidential transaction of the client node (530) by applying a cryptographic compromise scheme of transaction data comprises generating one or more compromise values from the confidential transaction of the client node ( 530) based on the transaction data and random numbers corresponding to the transaction data; and wherein the generation (536) of encrypted confidential transaction regulatory information comprises generating encrypted confidential transaction regulatory information by encrypting the transaction data and random numbers corresponding to the transaction data using the public key of the regulatory node (510).
[6]
6. METHOD (500), according to claim 1, characterized by the fact that the content of the confidential transaction also comprises a digital signature of the client node (530).
[7]
7. METHOD (500) IMPLEMENTED BY COMPUTER TO REGULATE CONFIDENTIAL TRANSACTIONS OF CONFIDENCE PROTOCOL, characterized by the fact that the method comprises:
Petition 870190058563, of 25/06/2019, p. 40/49
3/5 generate (512), through a regulating node of a trust protocol network, a pair of public key (514) and private key;
publish, through the regulatory node, the public key (514) to a plurality of client nodes (530, 540) of the trust protocol network;
obtain (516), through the regulator node (510) of a consensus node of the trust protocol network, a confidential transaction content from a client node (530, 540), where the confidential transaction content comprises:
one or more commitment values of the confidential transaction generated by the client node (530, 540), applying a cryptographic commitment scheme to the transaction data of the confidential transaction;
one or more proofs of zero knowledge of the transaction data; and encrypted regulatory information generated by the client node (530, 540) _ by encrypting the transaction data using the public key (514) of the regulatory node (510);
obtain (518) the transaction data by decrypting the encrypted regulatory information using the private key of the regulatory node (510); and verifying (519), through the regulatory node (510), that the confidential transaction is legitimate based on the content of the confidential transaction and the decrypted transaction data.
[8]
8. METHOD (500) according to claim 7, characterized by the fact that the transaction data of the confidential transaction comprises one or more account balances of the client node (530, 540) before the confidential transaction, or a value of confidential transaction transaction.
Petition 870190058563, of 25/06/2019, p. 41/49
4/5
[9]
9. METHOD (500), according to claim 7, characterized by the fact that one or more proofs of zero knowledge of the transaction data comprise one or more ranges of proof of zero knowledge that the values of the transaction data are within their respective intervals.
[10]
10. METHOD (500), according to claim 7, characterized by the fact that verifying that the confidential transaction is valid based on the contents of the confidential transaction and the decrypted transaction data comprises one or more of the following:
determine that one or more commitment values are correct based on the commitment scheme;
verify one or more proofs of zero knowledge of the transaction data; or determine that the values of the transaction data are in compliance with the regulations.
[11]
11. METHOD (500), according to claim 10, characterized by the fact that the verification of one or more proofs of zero knowledge of the transaction data comprises one or more of the following:
determining that an account balance of the client node (530, 540) before the confidential transaction is greater than zero;
determine that a transaction value of the confidential transaction is greater than zero; and determining that a transaction value of the confidential transaction is less than or equal to an account balance of the client node (530, 540) before the confidential transaction.
[12]
12. LEGIBLE MEDIA BY COMPUTER, characterized by the fact that it is coupled to one or more processors and having instructions
Petition 870190058563, of 25/06/2019, p. 42/49
5/5 stored therein which, when executed by one or more processors, cause one or more processors to perform operations according to the method, as defined in any one of claims 1 to 6.
[13]
13. SYSTEM FOR IMPLEMENTING A METHOD, characterized by the fact that it comprises:
a computing device; and a computer-readable storage device coupled to the computing device and having instructions stored on it that, when executed by the computing device, cause the computing device to perform operations according to the method, as defined in any one of claims 1 to 6.
[14]
14. LEGIBLE MEDIA BY COMPUTER, characterized by the fact that it is coupled to one or more processors and with instructions stored in it that, when executed by one or more processors, cause the one or more processors to perform operations according to the method, as defined in any of claims 7 to 11.
[15]
15. SYSTEM FOR IMPLEMENTING A METHOD, characterized by the fact that it comprises:
a computing device; and a computer-readable storage device coupled to the computing device and having instructions stored on it that, when executed by the computing device, cause the computing device to perform operations according to the method, as defined in any one of claims 7 to 11.

类似技术:

公开号 | 公开日 | 专利标题

BR112019008180A2|2019-09-10|computer-implemented method of a client node, computer-implemented method for regulating trusted protocol confidential transactions, non-transient computer-readable storage media, and systems

BR112019008168A2|2019-09-10|computer-implemented methods, computer-readable storage media, and system

ES2832709T3|2021-06-11|Systems and methods for updating a distributed ledger based on partial transaction validations

TW202034249A|2020-09-16|Methods and devices for protecting sensitive data of transaction activity based on smart contract in blockchain

ES2869166T3|2021-10-25|Cross-asset trading within blockchain networks

US20200279253A1|2020-09-03|Method, apparatus and electronic device for blockchain transactions

JP2020078081A|2020-05-21|Regulating blockchain confidential transactions

WO2020182234A2|2020-09-17|Methods and devices for transaction matching based on blockchain system

Futoransky et al.2019|Secure exchange of digital goods in a decentralized data marketplace

US20210326869A1|2021-10-21|Managing transactions in multiple blockchain networks

US20210398116A1|2021-12-23|Managing transactions in multiple blockchain networks

US20210311934A1|2021-10-07|Managing transactions in multiple blockchain networks

WO2021139605A1|2021-07-15|Methods and devices for providing decentralized identity verification

US20220036355A1|2022-02-03|Methods and devices for privacy-preserving verification of profit-sharing between users

JP2020046975A|2020-03-26|Fund transfer system and method for virtual currency

AL BAQARI et al.0|ADOPTION OF BLOCKCHAIN IN HEALTHCARE SECTOR

同族专利:

公开号 | 公开日

CA3041168A1|2019-04-18|

US20200250320A1|2020-08-06|

CA3041168C|2020-03-10|

JP6647731B2|2020-02-14|

SG11201903566XA|2019-05-30|

PH12019500894A1|2019-11-11|

EP3545647B1|2021-06-02|

PH12019500894B1|2019-11-11|

ZA201902560B|2021-05-26|

WO2019072261A2|2019-04-18|

US10678931B2|2020-06-09|

US10922421B2|2021-02-16|

WO2019072261A3|2019-09-12|

MX2019004652A|2019-08-05|

AU2018347185A1|2020-05-21|

EP3545647A4|2019-11-27|

EP3545647A2|2019-10-02|

KR20200054130A|2020-05-19|

US20190251270A1|2019-08-15|

KR102180991B1|2020-12-17|

CN110383311A|2019-10-25|

RU2720354C1|2020-04-29|

JP2020502865A|2020-01-23|

引用文献:

公开号 | 申请日 | 公开日 | 申请人 | 专利标题

US8156029B2|2005-02-24|2012-04-10|Michael Gregory Szydlo|Process for verifiably communicating risk characteristics of an investment portfolio|

AU2014321178A1|2013-09-20|2016-04-14|Visa International Service Association|Secure remote payment transaction processing including consumer authentication|

US9787647B2|2014-12-02|2017-10-10|Microsoft Technology Licensing, Llc|Secure computer evaluation of decision trees|

US20160162897A1|2014-12-03|2016-06-09|The Filing Cabinet, LLC|System and method for user authentication using crypto-currency transactions as access tokens|

WO2016200885A1|2015-06-08|2016-12-15|Blockstream Corporation|Cryptographically concealing amounts transacted on a ledger while preserving a network's ability to verify the transaction|

US20180191503A1|2015-07-14|2018-07-05|Fmr Llc|Asynchronous Crypto Asset Transfer and Social Aggregating, Fractionally Efficient Transfer Guidance, Conditional Triggered Transaction, Datastructures, Apparatuses, Methods and Systems|

US20170048209A1|2015-07-14|2017-02-16|Fmr Llc|Crypto Key Recovery and Social Aggregating, Fractionally Efficient Transfer Guidance, Conditional Triggered Transaction, Datastructures, Apparatuses, Methods and Systems|

CN108352015B|2016-02-23|2022-02-01|恩链控股有限公司|Secure multi-party loss-resistant storage and encryption key transfer for blockchain based systems in conjunction with wallet management systems|

EP3437048B1|2016-04-01|2021-06-09|ConsenSys Software Inc.|Systems and methods for providing data privacy in a private distributed ledger|

US10992649B2|2016-04-01|2021-04-27|Consensys Software Inc.|Systems and methods for privacy in distributed ledger transactions|

CN107438002B|2016-05-27|2022-02-11|索尼公司|Block chain based system and electronic device and method in system|

WO2017218983A1|2016-06-16|2017-12-21|The Bank Of New York Mellon|Distributed, centrally authored block chain network|

JP6663809B2|2016-07-07|2020-03-13|株式会社日立製作所|Audit device, anonymous remittance method with audit function and program|

CN107666388B|2016-07-28|2019-11-01|郑珂威|Block chain information encryption method based on complete homomorphic cryptography method|

US10657526B2|2016-10-28|2020-05-19|International Business Machines Corporation|System and method to dynamically setup a private sub-blockchain based on agility of transaction processing|

JP6293245B1|2016-11-25|2018-03-14|株式会社三井住友銀行|Transaction mutual monitoring system with enhanced security|

LU93377B1|2016-12-15|2018-07-03|Luxembourg Inst Science & Tech List|P2p network data distribution and retrieval using blockchain log|

US10158479B2|2017-02-06|2018-12-18|Northern Trust Corporation|Systems and methods for generating, uploading and executing code blocks within distributed network nodes|

CN106982205B|2017-03-01|2020-05-19|中钞信用卡产业发展有限公司杭州区块链技术研究院|Block chain-based digital asset processing method and device|

TW201837815A|2017-03-28|2018-10-16|泰德陽光有限公司|Distributed Auditing Method, Device, and System|

US20200213085A1|2017-06-14|2020-07-02|nChain Holdings Limited|Systems and methods for addressing security-related vulnerabilities arising in relation to off-blockchain channels in the event of failures in a network|

CN107566337B|2017-07-26|2019-08-09|阿里巴巴集团控股有限公司|Communication means and device between a kind of block chain node|

US10924466B2|2017-07-28|2021-02-16|SmartAxiom, Inc.|System and method for IOT security|

CN108418783B|2017-09-01|2021-03-19|矩阵元技术（深圳）有限公司|Method and medium for protecting privacy of intelligent contracts of block chains|

US10361859B2|2017-10-06|2019-07-23|Stealthpath, Inc.|Methods for internet communication security|

CN107833135A|2017-10-30|2018-03-23|中山大学|A kind of fair Protocol of Electronic Voting based on block chain|

CN108021821A|2017-11-28|2018-05-11|北京航空航天大学|Multicenter block chain transaction intimacy protection system and method|

CN108418689B|2017-11-30|2020-07-10|矩阵元技术（深圳）有限公司|Zero-knowledge proof method and medium suitable for block chain privacy protection|

US11057225B2|2017-12-07|2021-07-06|International Business Machines Corporation|Enforcing compute equity models in distributed blockchain|

US11238449B2|2017-12-18|2022-02-01|Nec Corporation|Efficient validation of transaction policy compliance in a distributed ledger system|

CN108335106A|2018-01-24|2018-07-27|深圳壹账通智能科技有限公司|The more account books of Zero Knowledge based on block chain exchange transfer account method, device and storage medium|

US10938557B2|2018-03-02|2021-03-02|International Business Machines Corporation|Distributed ledger for generating and verifying random sequence|

CN108492105A|2018-03-07|2018-09-04|物数（上海）信息科技有限公司|Transaction in assets monitoring and managing method, system, equipment and storage medium based on block chain|

CN108712261B|2018-05-10|2021-02-26|杭州智块网络科技有限公司|Key generation method, device and medium based on block chain|

CN108764874B|2018-05-17|2021-09-07|深圳前海微众银行股份有限公司|Anonymous transfer method, system and storage medium based on block chain|

CN108769173B|2018-05-21|2021-11-09|阿里体育有限公司|Block chain implementation method and equipment for running intelligent contracts|

US10171992B1|2018-06-22|2019-01-01|International Business Machines Corporation|Switching mobile service provider using blockchain|

US20200005307A1|2018-06-28|2020-01-02|International Business Machines Corporation|Collaborative analytics for fraud detection through a shared public ledger|

US10917233B2|2018-10-16|2021-02-09|International Business Machines Corporation|Selective exchange of transaction data|

AU2018347185A1|2018-11-07|2020-05-21|Alibaba Group Holding Limited|Regulating blockchain confidential transactions|

AU2018347185A1|2018-11-07|2020-05-21|Alibaba Group Holding Limited|Regulating blockchain confidential transactions|

WO2021033026A1|2019-08-19|2021-02-25|Bitfury Surround Gmbh|Techniques for enhanced data privacy in smart contracts for royalty distribution via a distributed ledger network|

CN110855631A|2019-10-24|2020-02-28|南京可信区块链与算法经济研究院有限公司|Monitorable zero knowledge verification method and system in block chain and storage medium|

CN110933045A|2019-11-08|2020-03-27|中国电子科技网络信息安全有限公司|Block chain digital asset privacy protection method based on commitment|

CN110808999B|2019-11-12|2022-02-15|中钞信用卡产业发展有限公司杭州区块链技术研究院|Service interaction method, device, equipment and storage medium|

US20210184863A1|2019-12-11|2021-06-17|Mastercard Asia/Pacific Pte. Ltd.|Method and system for regulation of blockchain-based payments|

CN110992034A|2019-12-13|2020-04-10|深圳市网心科技有限公司|Supply chain transaction privacy protection system and method based on block chain and related equipment|

CN113132095A|2019-12-31|2021-07-16|深圳市网心科技有限公司|Block chain cross-chain supervision method, system, device and computer storage medium|

CN111160909A|2019-12-31|2020-05-15|深圳市网心科技有限公司|Block chain supply chain transaction hiding static supervision system and method|

CN111161075A|2019-12-31|2020-05-15|深圳市网心科技有限公司|Block chain transaction data certification supervision method, system and related equipment|

CN111079190A|2019-12-31|2020-04-28|深圳市网心科技有限公司|Block chain supply chain transaction hiding dynamic supervision system and method|

CN111127020A|2019-12-31|2020-05-08|深圳市网心科技有限公司|Transaction data confusion method based on block chain and related equipment|

EP3794537A4|2020-02-03|2021-05-26|AlipayInformation Technology Co., Ltd.|Blockchain-based trustable guarantees|

EP3794484A4|2020-02-03|2021-05-05|AlipayInformation Technology Co., Ltd.|Blockchain-based trustable guarantees|

EP3799644A4|2020-02-03|2021-06-09|AlipayInformation Technology Co., Ltd.|Blockchain-based trustable guarantees|

EP3794483A4|2020-02-03|2021-04-28|AlipayInformation Technology Co., Ltd.|Blockchain-based trustable guarantees|

RU2757680C1|2020-07-13|2021-10-20|Федеральное государственное бюджетное образовательное учреждение высшего образования "Пятигорский государственный университет"|System for automated accounting, monitoring and payment for services based on blockchain and cryptography technologies|

法律状态:
2021-01-19| B25A| Requested transfer of rights approved|Owner name: ADVANTAGEOUS NEW TECHNOLOGIES CO., LTD. (KY) |

2021-02-09| B25A| Requested transfer of rights approved|Owner name: ADVANCED NEW TECHNOLOGIES CO., LTD. (KY) |

2021-10-05| B350| Update of information on the portal [chapter 15.35 patent gazette]|

优先权:

申请号 | 申请日 | 专利标题

PCT/CN2018/114314|WO2019072261A2|2018-11-07|2018-11-07|Regulating blockchain confidential transactions|

[返回顶部]